Weighted H-index for identifying influential spreaders

نویسندگان

  • Senbin Yu
  • Liang Gao
  • Yi-Fan Wang
  • Ge Gao
  • Congcong Zhou
  • Ziyou Gao
چکیده

Spreading is a ubiquitous process in the social, biological and technological systems. Therefore, identifying influential spreaders, which is important to prevent epidemic spreading and to establish effective vaccination strategies, is full of theoretical and practical significance. In this paper, a weighted h-index centrality based on virtual nodes extension is proposed to quantify the spreading influence of nodes in complex networks. Simulation results on real-world networks reveal that the proposed method provides more accurate and more consistent ranking than the five classical methods. Moreover, we observe that the monotonicity and the computational complexity of our measure can also yield excellent performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identifying Influential Spreaders by Weighted LeaderRank

Identifying influential spreaders is crucial for understanding and controlling spreading processes on social networks. Via assigning degree-dependent weights onto links associated with the ground node, we proposed a variant to a recent ranking algorithm named LeaderRank [L. Lü et al., PLoS ONE 6 (2011) e21202]. According to the simulations on the standard SIR model, the weighted LeaderRank perf...

متن کامل

A Community-Based Approach to Identifying Influential Spreaders

Identifying influential spreaders in complex networks has a significant impact on understanding and control of spreading process in networks. In this paper, we introduce a new centrality index to identify influential spreaders in a network based on the community structure of the network. The community-based centrality (CbC) considers both the number and sizes of communities that are directly li...

متن کامل

Leveraging local h-index to identify and rank influential spreaders in networks

Identifying influential nodes in complex networks has received increasing attention for its great theoretical and practical applications in many fields. Some classical methods, such as degree centrality, betweenness centrality, closeness centrality, and coreness centrality, were reported to have some limitations in detecting influential nodes. Recently, the famous h-index was introduced to the ...

متن کامل

Accurate prediction of influential spreaders in complex networks via message-passing approach

Identifying the most influential spreaders is one of outstanding problems in physics of complex systems. So far, many approaches have attempted to rank the influence of nodes but there is still the lack of accuracy to single out influential spreaders. Here, we directly tackle the problem of finding important spreaders by solving analytically the expected size of epidemic outbreaks when spreadin...

متن کامل

Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition

Identifying the most influential spreaders is an important issue in understanding and controlling spreading processes on complex networks. Recent studies showed that nodes located in the core of a network as identified by the k-shell decomposition are the most influential spreaders. However, through a great deal of numerical simulations, we observe that not in all real networks do nodes in high...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1710.05272  شماره 

صفحات  -

تاریخ انتشار 2017